Complexity classes

Results: 1120



#Item
31Invasive Lung and Bronchus Cancer in Kansas Residents, Age-Adjusted Incidence Rates by Sex and Race Sex Male  Race

Invasive Lung and Bronchus Cancer in Kansas Residents, Age-Adjusted Incidence Rates by Sex and Race Sex Male Race

Add to Reading List

Source URL: www.kumc.edu

Language: English - Date: 2016-05-12 12:20:48
32fea-mcgeoch.qxp:58 AM

fea-mcgeoch.qxp:58 AM

Add to Reading List

Source URL: www.ams.org

Language: English - Date: 2001-02-16 13:50:35
33Automatically Computing Program Path Complexity Lucas Bang, Abdulbaki Aydin, and Tevfik Bultan I. I NTRODUCTION Recent automated software testing techniques focus on achieving path coverage. We present a program complexi

Automatically Computing Program Path Complexity Lucas Bang, Abdulbaki Aydin, and Tevfik Bultan I. I NTRODUCTION Recent automated software testing techniques focus on achieving path coverage. We present a program complexi

Add to Reading List

Source URL: gswc.cs.ucsb.edu

Language: English - Date: 2016-03-01 02:43:37
34A maximum feasible linear subsystem problem for modeling noise pollution around airports Sandra Hommersom)

A maximum feasible linear subsystem problem for modeling noise pollution around airports Sandra Hommersom)

Add to Reading List

Source URL: www.math.ru.nl

Language: English - Date: 2016-04-12 05:51:20
35On the Hardness of Being Truthful  Christos Papadimitriou Michael Schapira

On the Hardness of Being Truthful Christos Papadimitriou Michael Schapira

Add to Reading List

Source URL: www.dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:56
36Channel Training and Estimation in Distributed Space-Time Coded Relay Networks with Multiple Transmit/Receive Antennas Sun Sun  Yindi Jing

Channel Training and Estimation in Distributed Space-Time Coded Relay Networks with Multiple Transmit/Receive Antennas Sun Sun Yindi Jing

Add to Reading List

Source URL: www.comm.utoronto.ca

Language: English - Date: 2013-07-09 12:30:00
37What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1  2

What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:56:58
38Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:44:56
39The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K.

The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K.

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2013-10-30 13:41:09
40Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann1 and Tobias Friedrich2,3 1

Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann1 and Tobias Friedrich2,3 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:44:42